Bounds on Average Weighted Depth of Decision Trees
نویسندگان
چکیده
Upper and lower bounds on minimal average weighted depth and minimal average depth of decision trees over arbitrary information systems are considered. In proofs methods of test theory and rough set theory are used.
منابع مشابه
Generalization in Threshold Networks , Combined DecisionTrees
We derive an upper bound on the generalization error of classiiers from a certain class of threshold networks. The bound depends on the margin of the classiier and the average complexity of the hidden units (where the average is over the weights assigned to each hidden unit). By representing convex combinations of decision trees or mask perceptrons as such threshold networks we obtain similar b...
متن کاملDynamic Programming Approach for Study of Decision Trees
In the presentation, we consider extensions of dynamic programming approach to the study of decision trees as algorithms for problem solving, as a way for knowledge extraction and representation, and as classifiers which, for a new object given by values of conditional attributes, define a value of the decision attribute. These extensions allow us (i) to describe the set of optimal decision tre...
متن کاملGeneralization in Threshold Networks, Combined Decision Trees and Combined Mask Perceptrons
We derive an upper bound on the generalization error of classi ers from a certain class of threshold networks. The bound depends on the margin of the classi er and the average complexity of the hidden units (where the average is over the weights assigned to each hidden unit). By representing convex combinations of decision trees or mask perceptrons as such threshold networks we obtain similar b...
متن کاملLower Bounds on Complexity of Testing Membership to a Polygon for Algebraic and Randomized Decision Trees
We describe a new method for proving lower bounds for algebraic decision trees. We prove, for the rst time, that the minimum depth for arbitrary decision trees for the problem of testing the membership to a polygon with N nodes is (log N). Moreover, we prove that the corresponding lower bound for the randomized decision trees matches the above bound. Finally, we prove that for the algebraic exp...
متن کاملNon-Malleable Codes from Average-Case Hardness: AC, Decision Trees, and Streaming Space-Bounded Tampering
We show a general framework for constructing non-malleable codes against tampering families with average-case hardness bounds. Our framework adapts ideas from the Naor-Yung double encryption paradigm such that to protect against tampering in a class F , it suffices to have average-case hard distributions for the class, and underlying primitives (encryption and non-interactive, simulatable proof...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Fundam. Inform.
دوره 31 شماره
صفحات -
تاریخ انتشار 1997